Vector majorization and a robust option
نویسنده
چکیده
We show that vector majorization and its related preference sets can be used to establish useful option pricing bounds for a robust option replacement investment strategy. This robust trading strategy can help to overcome some of the difficulties in implementing arbitrage option trading strategies when there exists model inaccuracy.
منابع مشابه
Block Diagonal Majorization on $C_{0}$
Let $mathbf{c}_0$ be the real vector space of all real sequences which converge to zero. For every $x,yin mathbf{c}_0$, it is said that $y$ is block diagonal majorized by $x$ (written $yprec_b x$) if there exists a block diagonal row stochastic matrix $R$ such that $y=Rx$. In this paper we find the possible structure of linear functions $T:mathbf{c}_0rightarrow mathbf{c}_0$ preserving $prec_b$.
متن کاملLinear Functions Preserving Multivariate and Directional Majorization
Let V and W be two real vector spaces and let &sim be a relation on both V and W. A linear function T : V → W is said to be a linear preserver (respectively strong linear preserver) of &sim if Tx &sim Ty whenever x &sim y (respectively Tx &sim Ty if and only if x &sim y). In this paper we characterize all linear functions T : M_{n,m} → M_{n,k} which preserve or strongly preserve multivariate an...
متن کاملLinear Functions Preserving Sut-Majorization on RN
Suppose $textbf{M}_{n}$ is the vector space of all $n$-by-$n$ real matrices, and let $mathbb{R}^{n}$ be the set of all $n$-by-$1$ real vectors. A matrix $Rin textbf{M}_{n}$ is said to be $textit{row substochastic}$ if it has nonnegative entries and each row sum is at most $1$. For $x$, $y in mathbb{R}^{n}$, it is said that $x$ is $textit{sut-majorized}$ by $y$ (denoted by $ xprec_{sut} y$) if t...
متن کاملMatrix majorization Geir Dahl
We study the conceptmatrix majorization: for two real matrices A and B having m rows we say that A majorizes B if there is a row-stochastic matrix X with AX = B. A special case is classical notion of vector majorization. Several properties and characterizations of matrix majorization are given. Moreover, interpretations of the concept in mathematical statistics are discussed and some combinator...
متن کاملNonlinear Support Vector Machines Through Iterative Majorization and I-Splines
To minimize the primal support vector machine (SVM) problem, we propose to use iterative majorization. To do so, we propose to use iterative majorization. To allow for nonlinearity of the predictors, we use (non)monotone spline transformations. An advantage over the usual kernel approach in the dual problem is that the variables can be easily interpreted. We illustrate this with an example from...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008